Hybrid Trust Model For Internet Routing
نویسندگان
چکیده
منابع مشابه
Hybrid Trust Model for Internet Routing
The current Internet is based on a fundamental assumption of reliability and good intent among actors in the network. Unfortunately, unreliable and malicious behaviour is becoming a major obstacle for Internet communication. In order to improve the trustworthiness and reliability of the network infrastructure, we propose a novel trust model to be incorporated into BGP routing. In our approach, ...
متن کاملA hybrid metaheuristic algorithm for the robust pollution-routing problem
Emissions resulted from transportation activities may lead to dangerous effects on the whole environment and human health. According to sustainability principles, in recent years researchers attempt to consider the environmental burden of logistics activities in traditional logistics problems such as vehicle routing problems (VRPs). The pollution-routing problem (PRP) is an extension of the VRP...
متن کاملFuzzy-Based Trust Prediction Model for Routing in WSNs
The cooperative nature of multihop wireless sensor networks (WSNs) makes it vulnerable to varied types of attacks. The sensitive application environments and resource constraints of WSNs mandate the requirement of lightweight security scheme. The earlier security solutions were based on historical behavior of neighbor but the security can be enhanced by predicting the future behavior of the nod...
متن کاملA Trust Model Based Routing Protocol For MANET
In mobile ad hoc networks (MANETs), the provision of quality of service (QoS) guarantees is much more challenging than in wire line networks, mainly due to node mobility, multi hop communications, contention for channel access, and a lack of central coordination. The difficulties in the provision of such guarantees have limited the usefulness of MANETs. In the last decade, much research attenti...
متن کاملA HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM
The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of Computer Networks & Communications
سال: 2011
ISSN: 0975-2293
DOI: 10.5121/ijcnc.2011.3301